Computing MAP trajectories by representing, propagating and combining PDFs over groups
نویسندگان
چکیده
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differential measurements from odometry or inertial sensors. A fast method is presented for fusing these two sources of information to obtain the maximum a posteriori estimate of the trajectory. A formalism is introduced for representing probability density functions over Euclidean transformations, and it is shown how these density functions can be propagated along the data sequence and how multiple estimates of a transformation can be combined. A three-pass algorithm is described which makes use of these results to yield the trajectory of the camera. Simulation results are presented which are validated against a physical analogue of the vision problem, and results are then shown from sequences of approximately 1,800 frames captured from a video camera mounted on a go-kart. Several of these frames are processed using computer vision to obtain estimates of the position of the go-kart. The algorithm fuses these estimates with odometry from the entire sequence in 150 mS to obtain the trajectory of the kart.
منابع مشابه
The effectiveness of multi-criteria analysis and GIS modeling to identify suitable places for rainwater extraction in Dehbar area of Torqabeh-Shandiz city
The purpose of this study is to accurately measure the watershed potential for constructing rainwater harvesting structures. To carry out this research, the DEM digital-elevation model layer was used to prepare slope, hydrological soil groups and land use maps in the Arc GIS 10.3 software. The drainage density map was prepared by combining the DEM layer, topographic map, drainage density and hy...
متن کاملAn Enhanced MSS-based checkpointing Scheme for Mobile Computing Environment
Mobile computing systems are made up of different components among which Mobile Support Stations (MSSs) play a key role. This paper proposes an efficient MSS-based non-blocking coordinated checkpointing scheme for mobile computing environment. In the scheme suggested nearly all aspects of checkpointing and their related overheads are forwarded to the MSSs and as a result the workload of Mobile ...
متن کاملOptimal Trajectory Generation for a Robotic Worm via Parameterization by B-Spline Curves
In this paper we intend to generate some set of optimal trajectories according to the number of control points has been applied for parameterizing those using B-spline curves. The trajectories are used to generate an optimal locomotion gait in a crawling worm-like robot. Due to gait design considerations it is desired to minimize the required torques in a cycle of gait. Similar to caterpillars,...
متن کاملEnergy Detection of Unknown Signals over Composite multipath/shadowing Fading Channels
In this paper, the performance analysis of an energy detector is exploited over composite multipath/shadowing fading channels, which is modeled by Rayleigh-lognormal (RL) distribution. Based on an approximate channel model which was recently proposed by the author, the RL envelope probability density function (pdf) is approximated by a finite sum of weighted Rayleigh pdfs. Relying on this inter...
متن کاملCellular Automata to More Efficiently Compute the Collatz Map
The Collatz, or 3x+ 1, Conjecture claims that for every positive integer n, there exists some k such that T (n) = 1, where T is the Collatz map. We present three cellular automata (CA) that transform the global problem of mimicking the Collatz map in bases 2, 3, and 4 into a local one of transforming the digits of iterates. The CAs streamline computation first by bypassing calculation of certai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003